New Upper Bounds on Various String Manipulation Problems
نویسندگان
چکیده
In this chapter we deal with various string manipulation problems which originate from the field of computational biology and musicology. These problems are: “approximate string matching with gaps”, “inference of maximal pairs in a set of strings” and “handling of weighted sequences”. We provide new upper bounds for solving these problems and for the third we propose a novel data structure, for the representation of the weighted sequences, which inherits most of the properties of the suffix tree.
منابع مشابه
Lower Bounds for Discrete Logarithms and Related Problems
This paper considers the computational complexity of the discrete logarithm and related problems in the context of \generic algorithms"|that is, algorithms which do not exploit any special properties of the encodings of group elements, other than the property that each group element is encoded as a unique binary string. Lower bounds on the complexity of these problems are proved that match the ...
متن کاملUpper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices which occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees and posting lists. Labeled trees are applied in XM...
متن کاملExact quantum query complexity of weight decision problems
The weight decision problem, which requires to determine the Hamming weight of a given binary string, is a natural and important problem, with applications in cryptanalysis, coding theory, fault-tolerant circuit design and so on. In particular, both Deutsch-Jozsa problem and Grover search problem can be interpreted as special cases of weight decision problems. In this work, we investigate the e...
متن کاملOptimal Trade-Offs for Succinct String Indexes
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of queries on s: select(c, j), returning the position in s containing the jth occurrence of c, and rank(c, p), counting how many occurrences of c are found in the f...
متن کاملHighly Parallelizable Problems
of Results. We establish that several problems are highly parallelizable. For each of these problems, we design an optimal O (loglogn ) time parallel algorithm on the Common CRCW PRAM model which is the weakest among the CRCW PRAM models. These problems include: g all nearest smaller values, g preprocessing for answering range maxima queries, g several problems in Computational Geometry, g stri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004